New low hardness rubber.

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Grain Hardness Tester

.\ hardness tester, especially adapted for grain, was cor~structecl by modifying a commercial portable soft metal tester known as the Barcol Impressor. h preloaded stylus is forced into grain sections preparetl by rneans ot a microtome. The displacement of the stylus, nleasured by a dial micrometer, is used as a hardness index. This has been related to tlie l'ickers tlianlontl pyramid hardness ...

متن کامل

Low-Load Vickers Microindentation Hardness Testing

ADVANCED MATERIALS & PROCESSES • APRIL 2012 I n 1925 in the UK, Smith and Sandland developed an indentation test that used a squarebased pyramidal-shaped indenter made of diamond[1]. The test was developed because the Brinell test (introduced in 1900), which (until recently) used a round hardened steel ball indenter, could not test steels harder than ~450 HB (~48 HRC). They chose this shape wit...

متن کامل

New Hardness Results in Rainbow Connectivity

A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices. The (strong) rainbow connectivity of a graph G, denoted by (src(G), respectively) rc(G) is the smallest number of colors required to edge color the graph such ...

متن کامل

Surjective H-Colouring: New Hardness Results

A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the vertex set of H such that there is an edge between vertices f(u) and f(v) of H whenever there is an edge between vertices u and v of G. The H-Colouring problem is to decide if a graph G allows a homomorphism to a fixed graph H . We continue a study on a variant of this problem, namely the Surjective...

متن کامل

Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs

Up to now, the known derandomization methods for BPP have been derived assuming the existence of an ExP function that has a "hard" average-case circuit complexity. In this paper we instead present the first construction of a de-randomization method for BOP that relies on the existence of an EXP function that is hard only in the worst-case. The construction is based on a new method that departs ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: NIPPON GOMU KYOKAISHI

سال: 1990

ISSN: 1884-0442,0029-022X

DOI: 10.2324/gomu.63.250